Repairing Plans On-the--y

نویسندگان

  • Brian Drabble
  • Je Dalton
  • Austin Tate
چکیده

Even with the most careful advance preparation and even with inbuilt allowance for some degree of contin gency plans need to be altered to take into account execution circumstances and changes of requirements We have developed methods for repairing plans to ac count for execution failures and changes in the execu tion situation We rst developed these methods for the Optimum aiv planner designed to support space craft assembly integration and veri cation at ESA and later deployed for Ariane iv payload bay AIV This system was itself based on our Nonlin and O Plan planning algorithms and plan representation We sub sequently re ned the methods for the O Plan planner and incorporated plan repair methods into the system This paper describes the algorithms used for plan re pair in O Plan and gives an example of their use

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Red-Black Relaxed Plan Heuristics Reloaded

Despite its success, the delete relaxation has significant pitfalls. In an attempt to overcome these pitfalls, recent work has devised so-called red-black relaxed plan heuristics, where red variables take the relaxed semantics (accumulating their values), while black variables take the regular semantics. These heuristics were shown to significantly improve over standard delete relaxation heuris...

متن کامل

Query-driven Repairing of Inconsistent DL-Lite Knowledge Bases (Extended Abstract)

We consider the problem of query-driven repairing of inconsistent DL-Lite knowledge bases: query answers are computed under inconsistency-tolerant semantics, and the user provides feedback about which answers are erroneous or missing. The aim is to find a set of ABox modifications (deletions and additions), called a repair plan, that addresses as many of the defects as possible. After formalizi...

متن کامل

Query-Driven Repairing of Inconsistent DL-Lite Knowledge Bases

We consider the problem of query-driven repairing of inconsistent DL-Lite knowledge bases: query answers are computed under inconsistency-tolerant semantics, and the user provides feedback about which answers are erroneous or missing. The aim is to find a set of ABox modifications (deletions and additions), called a repair plan, that addresses as many of the defects as possible. After formalizi...

متن کامل

Multiagent plan repair by combined prefix and suffix reuse

Deterministic domain-independent multiagent planning is an approach to coordination of cooperative agents with joint goals. Provided that the agents act in an uncertain and dynamic environment, such plans can fail. The straightforward approach to recover from such situations is to compute a new plan from scratch, that is to replan. Even though, in a worst case, plan repair or plan re-use does n...

متن کامل

Repairing Plans On-the-fly

Even with the most careful advance preparation, and even with inbuilt allowance for some degree of contingency, plans need to be altered to take into account execution circumstances and changes of requirements. We have developed methods for repairing plans to account for execution failures and changes in the execution situation. We first developed these methods for the Optimum-AIV planner desi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997